Uncovering Hidden Community Structure in Multi-Layer Networks
نویسندگان
چکیده
Community detection, also known as graph clustering, in multi-layer networks has been extensively studied the literature. The goal of community detection is to partition vertices a network into densely connected components so called communities. Networks contain set strong, dominant communities, which may interfere with weak, natural structure. When most members weak communities belong stronger they are extremely hard be uncovered. We call hidden or disguised In this paper, we present method uncover by weakening strength With aim detect through experiments, observe real-world answer question whether have structure not. Results (HCD) showed great variation number detected multiple layers when compared results other methods.
منابع مشابه
Uncovering fuzzy community structure in complex networks.
There has been an increasing interest in properties of complex networks, such as small-world property, power-law degree distribution, and network transitivity which seem to be common to many real world networks. In this study, a useful community detection method based on non-negative matrix factorization (NMF) technique is presented. Based on a popular modular function, a proper feature matrix ...
متن کاملCommunity Detection in Multi-Layer Networks
Recent years have seen a surge of interest in community detection and a large range of algorithms have been designed and applied to this specific task. However, the vast majority of the work done in the area has been concerned with simple weighted graphs. This results in some of the real world systems being oversimplified to fit this model. In this project, I design a new community detection al...
متن کاملUncovering Overlap Community Structure in Complex Networks Using Particle Competition
Identification and classification of overlap nodes in communities is an important topic in data mining. In this paper, a new clustering method to uncover overlap nodes in complex networks is proposed. It is based on particles walking and competing with each other, using randomdeterministic movement. The new community detection algorithm can output not only hard labels, but also continuous-value...
متن کاملUncovering Hidden Structure through Parallel Problem Decomposition
A key strategy for speeding up computation is to run in parallel on multiple cores. However, on hard combinatorial problems, exploiting parallelism has been surprisingly challenging. It appears that traditional divide-and-conquer strategies do not work well, due to the intricate non-local nature of the interactions between the problem variables. In this paper, we introduce a novel way in which ...
متن کاملUncovering the hidden geometry behind metabolic networks.
Metabolism is a fascinating cell machinery underlying life and disease and genome-scale reconstructions provide us with a captivating view of its complexity. However, deciphering the relationship between metabolic structure and function remains a major challenge. In particular, turning observed structural regularities into organizing principles underlying systemic functions is a crucial task th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2021
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app11062857